Counting truth assignments of formulas of bounded tree-width or clique-width
نویسندگان
چکیده
منابع مشابه
Counting truth assignments of formulas of bounded tree-width or clique-width
We study algorithms for ]SAT and its generalized version ]GENSAT, the problem of computing the number of satisfying assignments of a set of propositional clauses . For this purpose we consider the clauses given by their incidence graph, a signed bipartite graph SI( ), and its derived graphs I( ) and P ( ). It is well known, that, given a graph of tree-width k, a k-tree decomposition can be foun...
متن کاملModel Counting for Formulas of Bounded Clique-Width
We show that #SAT is polynomial-time tractable for classes of CNF formulas whose incidence graphs have bounded symmetric clique-width (or bounded clique-width, or bounded rank-width). This result strictly generalizes polynomial-time tractability results for classes of formulas with signed incidence graphs of bounded clique-width and classes of formulas with incidence graphs of bounded modular t...
متن کاملDeciding Clique-Width for Graphs of Bounded Tree-Width
We show that there exists a linear time algorithm for deciding whether a graph of bounded tree-width has clique-width k for some fixed integer k. Communicated by Giuseppe Liotta and Ioannis G. Tollis: submitted October 2001; revised July 2002 and February 2003. The work of the second author was supported by the German Research Association (DFG) grant WA 674/9-2. W. Espelage et al., Deciding Cli...
متن کاملCollective Tree Spanners in Graphs with Bounded Genus, Chordality, Tree-Width, or Clique-Width
In this paper we study collective additive tree spanners for special families of graphs including planar graphs, graphs with bounded genus, graphs with bounded tree-width, graphs with bounded cliquewidth, and graphs with bounded chordality. We say that a graph G = (V,E) admits a system of μ collective additive tree r-spanners if there is a system T (G) of at most μ spanning trees of G such that...
متن کاملThe NLC-width and clique-width for powers of graphs of bounded tree-width
The k-power graph of a graph G is a graphwith the same vertex set as G, in that two vertices are adjacent if and only if, there is a path between them in G of length at most k. A k-treepower graph is the k-power graph of a tree, a k-leaf-power graph is the subgraph of some k-tree-power graph induced by the leaves of the tree. We show that (1) every k-tree-power graph has NLC-width at most k + 2...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2008
ISSN: 0166-218X
DOI: 10.1016/j.dam.2006.06.020